The Game Chromatic Number of Some Families of Cartesian Product Graphs
نویسنده
چکیده
We find exact values for the game chromatic number of the Cartesian product graphs Sm¤Pn, Sm¤Cn, P2¤Wn, and P2¤Km,n. This extends previous results of Bartnicki et al. on the game chromatic number of Cartesian product graphs.
منابع مشابه
Game coloring the Cartesian product of graphs
This article proves the following result: Let G and G′ be graphs of orders n and n′, respectively. Let G∗ be obtained from G by adding to each vertex a set of n′ degree 1 neighbors. If G∗ has game coloring number m and G′ has acyclic chromatic number k, then the Cartesian product G G′ has game chromatic number at most k(k+m − 1). As a consequence, the Cartesian product of two forests has game c...
متن کاملGame Chromatic Number of Cartesian Product Graphs
The game chromatic number χg is considered for the Cartesian product G 2 H of two graphs G and H. We determine exact values of χg(G2H) when G and H belong to certain classes of graphs, and show that, in general, the game chromatic number χg(G2H) is not bounded from above by a function of game chromatic numbers of graphs G and H. An analogous result is proved for the game coloring number colg(G2...
متن کاملThe reliability Wiener number of cartesian product graphs
Reliability Wiener number is a modification of the original Wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. Various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...
متن کاملSecret Sharing Based On Cartesian product Of Graphs
The purpose of this paper is to study the information ratio of perfect secret sharing of product of some special families of graphs. We seek to prove that the information ratio of prism graphs $Y_{n}$ are equal to $frac{7}{4}$ for any $ngeq 5$, and we will gave a partial answer to a question of Csirmaz cite{CL}. We will also study the information ratio of two other families $C_{m}times C_{n}$ a...
متن کاملOn global (strong) defensive alliances in some product graphs
A defensive alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at most one moreneighbor outside of $S$ than it has inside of $S$. A defensive alliance $S$ is called global if it forms a dominating set. The global defensive alliance number of a graph $G$ is the minimum cardinality of a global defensive alliance in $G$. In this article we study the global ...
متن کامل